Attaching Multiple Prepositional Phrases: Generalized Backed-off Estimation

نویسندگان

  • Paola Merlo
  • Matthew W. Crocker
  • Cathy Berthouzoz
چکیده

There has recently been considerable interest in the use of lexically-based statistical techniques to resolve prepositional phrase attachments. To our knowledge, however, these investigations have only considered the problem of attaching the first PP, i.e., in a [V NP PP] configuration. In this paper, we consider one technique which has been successfully applied to this problem, backed-off estimation, and demonstrate how it can be extended to deal with the problem of multiple PP attachment. The multiple PP attachment introduces two related problems: sparser data (since multiple PPs are naturally rarer), and greater syntactic ambiguity (more attachment configurations which must be distinguished). We present and algorithm which solves this problem through re-use of the relatively rich data obtained from first PP training, in resolving subsequent PP attachments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Attaching Multiple Prepositional Phrases: Generalized Backed-oo Estimation

There has recently been considerable interest in the use of lexically-based statistical techniques to resolve preposition-al phrase attachments. To our knowledge , however, these investigations have only considered the problem of attaching the rst PP, i.e., in a V NP PP] conngura-tion. In this paper, we consider one technique which has been successfully applied to this problem, backed-oo estima...

متن کامل

Prepositional Phrase Attachment through a Backed-O Model

Recent work has considered corpus-based or statistical approaches to the problem of prepositional phrase attachment ambiguity. Typically, ambiguous verb phrases of the form v np1 p np2 are resolved through a model which considers values of the four head words (v, n1, p and n2). This paper shows that the problem is analogous to n-gram language models in speech recognition, and that one of the mo...

متن کامل

A Labelled Corpus for Prepositional Phrase Attachment

This paper describes a labelled corpus intended for training learning algorithms to attach prepositional phrases (PPs). Taken from the PTB2, we believe it is the largest available resource for this purpose, especially as it contains many patterns in which PPs occur ambiguously (nearly all previous research has focused on just one pattern) and we present some results for the five most common pat...

متن کامل

Maximum Entropy Models and Prepositional Phrase Ambiguity

Prepositional phrases are a common source of ambiguity in natural language and many approaches have been devised to resolve this ambiguity automatically. In particular, several different machine learning approaches have now reached accuracy rates of around 84.5% on the benchmark dataset. Maximum entropy (maxent) models, despite their successful application in many other areas of natural languag...

متن کامل

Prepositional Phrase Attachment through a Backed-off Model

Recent work has considered corpus-based or statistical approaches to the problem of prepositional phrase a t tachment ambiguity. Typically, ambiguous verb phrases of the form v rip1 p rip2 are resolved through a model which considers values of the four head words (v, n l , p and 77,2). This paper shows that the problem is analogous to n-gram language models in speech recognition, and that one o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره cmp-lg/9710005  شماره 

صفحات  -

تاریخ انتشار 1997